Biclustering of Gene Expression Data using a Two - Phase Method
نویسندگان
چکیده
Biclustering is a very useful data mining technique which identifies coherent patterns from microarray gene expression data. A bicluster of a gene expression dataset is a subset of genes which exhibit similar expression patterns along a subset of conditions. Biclustering is a powerful analytical tool for the biologist and has generated considerable interest over the past few decades. Many biclustering algorithms optimize a mean squared residue to discover biclusters from a gene expression dataset. In this paper a Two-Phase method of finding a bicluster is developed. In the first phase, a modified version of k-means algorithm is applied to the gene expression data to generate k clusters. In the second phase, an iterative search is performed to check the possibility of removing more genes and conditions within the given threshold value of mean squared residue score. Experimental results on yeast dataset show that our approach can effectively find high quality biclusters
منابع مشابه
به کارگیری خوشهبندی دوبعدی با روش «زیرماتریسهای با میانگین- درایههای بزرگ» در دادههای بیان ژنی حاصل از ریزآرایههای DNA
Background and Objective: In recent years, DNA microarray technology has become a central tool in genomic research. Using this technology, which made it possible to simultaneously analyze expression levels for thousands of genes under different conditions, massive amounts of information will be obtained. While traditional clustering methods, such as hierarchical and K-means clustering have been...
متن کاملBiFree: An Efficient Biclustering Technique for Gene Expression Data Using Two Layer Free Weighted Bipartite Graph Crossing Minimization
Conventional clustering technique for gene expression data provides a global view of the data. In the biological prospective, a local view is essential for better analysis of gene expression data with simultaneous grouping of genes and conditions. Several biclustering techniques have been proposed in the literature based on different problem formulation. Therefore, it is difficult to compare th...
متن کاملAn Improved Biclustering Algorithm for Gene Expression Data
Cheng-Church (CC) biclustering algorithm is the popular algorithm for the gene expression data mining at present. Only find one biclustering can be found at one time and the biclustering that overlap each other can hardly be found when using this algorithm. This article puts forward a modified algorithm for the gene expression data mining that uses the middle biclustering result to conduct the ...
متن کاملApplication of Cardinality based GRASP to the Biclustering of Gene Expression Data
Biclustering algorithms perform simultaneous row and column clustering of a given data matrix. In gene expression dataset a bicluster is a subset of genes that exhibit similar expression patterns through a subset of conditions. Biclustering is a useful data mining technique for identifying local patterns from gene expression data. In this paper biclusters are identified in two steps. In the fir...
متن کاملContext Specific and Differential Gene Co-expression Networks via Bayesian Biclustering
Identifying latent structure in high-dimensional genomic data is essential for exploring biological processes. Here, we consider recovering gene co-expression networks from gene expression data, where each network encodes relationships between genes that are co-regulated by shared biological mechanisms. To do this, we develop a Bayesian statistical model for biclustering to infer subsets of co-...
متن کامل